Multi-Depot Heterogeneous Vehicle Routing Optimization for Hazardous Materials Transportation

This paper considers a multi-depot heterogeneous vehicle routing problem (MDHVRP) with time windows, which is very crucial for hazardous materials transportation. For this reason, we formalize as multi-objective MDHVRP optimization model, where the actual load dependent risk of transportation considered. To solve problem, propose hybrid evolutionary algorithm (HMOEA) and two-stage (TSA). In addition, verify performance proposed algorithms by experiments on modified Solomon’s VRPTW examples. experiment, it can be seen from distribution Pareto solution sets convergence IGD values that HMOEA significantly superior to other three in searching solutions, well diversity algorithm. TSA were compared, minimum cost obtained was 13.38% lower than HMOEA, while 81.69% higher HMOEA. The advantages each finding solutions reality analyzed. A comparison made between multi-depots VRP homogeneous C101 instance, results showed scheduling vehicles would reduce cost.